Search results for "network [detector]"
showing 10 items of 496 documents
A note on Taskinen's counterexamples on the problem of topologies of Grothendieck
1989
By the work of Taskinen (see [4, 5]), we know that there is a Fréchet space E such that Lb(E, l2) is not a (DF)-space. Moreover there is a Fréchet–Montel space F such that is not (DF). In this second example, the duality theorem of Buchwalter (cf. [2, §45.3]) can be applied to obtain that and hence is a (gDF)-space (cf. [1, Ch. 12 or 3, Ch. 8]). The (gDF)-spaces were introduced by several authors to extend the (DF)-spaces of Grothendieck and to provide an adequate frame to consider strict topologies.
L-fuzzy syntopogenous structures, Part I: Fundamentals and application to L-fuzzy topologies, L-fuzzy proximities and L-fuzzy uniformities
2013
Abstract We introduce the concept of an L-fuzzy syntopogenous structure where L is a complete lattice endowed with an implicator ↦ : L × L → L satisfying certain properties (in particular, as L one can take an MV-algebra). As special cases our L-fuzzy syntopogenous structures contain classical Csaszar syntopogenous structures, Katsaras–Petalas fuzzy syntopogenous structures as well as fuzzy syntopogeneous structures introduced in the previous work of the second named author (A. Sostak, Fuzzy syntopogenous structures, Quaest. Math. 20 (1997) 431–461). Basic properties of the category of L-fuzzy syntopogenous spaces are studied; categories of L-fuzzy topological spaces, L-fuzzy proximity spac…
Relations between structure and estimators in networks of dynamical systems
2011
The article main focus is on the identification of a graphical model from time series data associated with different interconnected entities. The time series are modeled as realizations of stochastic processes (representing nodes of a graph) linked together via transfer functions (representing the edges of the graph). Both the cases of non-causal and causal links are considered. By using only the measurements of the node outputs and without assuming any prior knowledge of the network topology, a method is provided to estimate the graph connectivity. In particular, it is proven that the method determines links to be present only between a node and its “kins”, where kins of a node consist of …
Quantized Dissensus in Networks of Agents subject to Death and Duplication
2012
Dissensus is a modeling framework for networks of dynamic agents in competition for scarce resources. Originally inspired by biological cells behaviors, it fits also marketing, finance and many other application areas. Competition is often unstable in the sense that strong agents, those having access to large resources, gain more and more resources at the expense of weak agents. Thus, strong agents duplicate when reaching a critical amount of resources, whereas weak agents die when loosing all their resources. To capture all these phenomena we introduce systems with a discrete time gossip and unstable state dynamics interrupted by discrete events affecting the network topology. Invariancy o…
Network Entropy for the Sequence Analysis of Functional Connectivity Graphs of the Brain
2018
Dynamic representation of functional brain networks involved in the sequence analysis of functional connectivity graphs of the brain (FCGB) gains advances in uncovering evolved interaction mechanisms. However, most of the networks, even the event-related ones, are highly heterogeneous due to spurious interactions, which bring challenges to revealing the change patterns of interactive information in the complex dynamic process. In this paper, we propose a network entropy (NE) method to measure connectivity uncertainty of FCGB sequences to alleviate the spurious interaction problem in dynamic network analysis to realize associations with different events during a complex cognitive task. The p…
Optimal Usage of Multiple Network Connections
2008
In the future mobile networks, a mobile terminal is able to select the best suitable network for each data transmission. The selection of a network connection to be used has been under a lot of study. In this paper, we consider a more extensive case in which we do not select a network connection but use several network connections simultaneously to transfer data. When data is transferred using multiple network connections, a network connection has to be selected for each component of the data. We have modelled this problem as a multiobjective optimization problem and developed a heuristic to solve the problem fast in a static network environment. In this paper, we discuss solving the proble…
Hub-Centered Gene Network Reconstruction Using Automatic Relevance Determination
2012
Network inference deals with the reconstruction of biological networks from experimental data. A variety of different reverse engineering techniques are available; they differ in the underlying assumptions and mathematical models used. One common problem for all approaches stems from the complexity of the task, due to the combinatorial explosion of different network topologies for increasing network size. To handle this problem, constraints are frequently used, for example on the node degree, number of edges, or constraints on regulation functions between network components. We propose to exploit topological considerations in the inference of gene regulatory networks. Such systems are often…
E-Government's Role in Shifting the Paradigm of Performance in the Public Sector
2015
The emergence of e-government changed the world of the Public Administration (PA) and the discipline of Public Management dramatically. Through the presentation of a case- study of the municipality of Palermo, this article attempts to discuss the renewed need for assessing performance of e-government services in a local government and to disclose the main critical issues in accomplishing this evaluation. Palermo is experiencing the implementation of a second- generation e-government project that is embodied in the realization of a web portal. The conceptualization of a framework to assess the performance of the digital services appears to be crucial in order to improve the system and to avo…
Resistant Microbial Cooccurrence Patterns Inferred by Network Topology
2015
ABSTRACT Although complex cooccurrence patterns have been described for microbes in natural communities, these patterns have scarcely been interpreted in the context of ecosystem functioning and stability. Here we constructed networks from species cooccurrences between pairs of microorganisms which were extracted from five individual aquatic time series, including a dystrophic and a eutrophic lake as well as an open ocean site. The resulting networks exhibited higher clustering coefficients, shorter path lengths, and higher average node degrees and levels of betweenness than those of random networks. Moreover, simulations demonstrated that taxa with a large number of cooccurrences and place…
Dominant and emerging approaches in the study of higher education policy change
2012
The purpose of the article is to analyse recent literature on higher education policy change. Based on the review, three different approaches are distinguished: structural, actor and agency. In the structural approach the dynamic of policy change originates in well-established structures. The actor approach focuses on either individual or institutional actors as the drivers of policy change. The agency approach understands higher education policy change as an interactive process between various actors and domains within transient structures. We will also present two emerging, alternative approaches: actor-network theory, which takes interaction as a starting point and proposes that no organ…